منابع مشابه
An Improved CPU Scheduling Algorithm
In multiprogramming systems i.e. in systems where several processes reside in memory, organization of processes is very important so that CPU always has one to execute. CPU scheduling is the base of multiprogramming operating systems. CPU executes one process at a time and switches between processes to improve CPU utilization. CPU scheduling strategies help in selecting the next process to be e...
متن کاملAn Optimized Round Robin Scheduling Algorithm for CPU Scheduling
The main objective of this paper is to develop a new approach for round robin scheduling which help to improve the CPU efficiency in real time and time sharing operating system. There are many algorithms available for CPU scheduling. But we cannot implemented in real time operating system because of high context switch rates, large waiting time, large response time, large trn around time and le...
متن کاملFuzzy Priority CPU Scheduling Algorithm
There are several CPU scheduling algorithms like FCFS, SRTN,RR , priority etc. Scheduling decision of these algorithms are based on parameters which are assumed to be crisp. However, in many circumstances these parameters are vague. The vagueness of these parameters suggests that scheduler should use fuzzy logic in scheduling the jobs. A fuzzy priority CPU scheduling algorithm has been proposed...
متن کاملComparison of Performance of RR CPU Scheduling Algorithm with Different Dynamic CPU Scheduling Algorithm
Round Robin CPU scheduling algorithm use fixed time quantum in timeshared system. In timeshared system performance is totally depends upon the selection of time quantum. Static time quantum and selection of time quantum both reason in RR CPU scheduling algorithm is disadvantage for the CPU performance. In this paper study the different dynamic RR CPU scheduling algorithm and discuss the selecti...
متن کاملAn Improved Quantum Scheduling Algorithm
The scheduling problem consists of finding a common 1 in two remotely located N bit strings. Denote the number of 1s in the string with the fewer 1s by N . Classically, it needs at least O( N log2 N) bits of communication to find the common 1. The best known quantum algorithm would require O( √ N log2 N) qubits of communication. This paper gives a quantum algorithm to find the common 1 with onl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Information Systems
سال: 2013
ISSN: 2249-0868
DOI: 10.5120/ijais13-451057